Computing with Exact Real Numbers in a Radix-r System
نویسندگان
چکیده
منابع مشابه
Computing with Classical Real Numbers
There are two incompatible Coq libraries that have a theory of the real numbers; the Coq standard library gives an axiomatic treatment of classical real numbers, while the CoRN library from Nijmegen defines constructively valid real numbers. Unfortunately, this means results about one structure cannot easily be used in the other structure. We present a way interfacing these two libraries by sho...
متن کاملNew Representation for Exact Real Numbers 1
We develop the theoretical foundation of a new representation of real numbers based on the innnite composition of linear fractional transformations (lft), equivalently the innnite product of matrices, with non-negative coeecients. Any rational interval in the one point compactiication of the real line, represented by the unit circle S 1 , is expressed as the image of the base interval 0; 1] und...
متن کاملConstructive analysis, types and exact real numbers
In the present paper, we will discuss various aspects of computable/constructive analysis, namely semantics, proofs and computations. We will present some of the problems and solutions of exact real arithmetic varying from concrete implementations, representation and algorithms to various models for real computation. We then put these models in a uniform framework using realisability, opening t...
متن کاملA simple method for computing exact probabilities of mutation numbers.
We describe a method for the recursive computation of exact probability distributions for the number of neutral mutations segregating in samples of arbitrary size and configuration. Construction of the recursions requires only characterization of evolutionary changes as a Markov process and determination of one-step transition matrices. We address the pattern of nucleotide diversity at a neutra...
متن کاملPCF extended with real numbers : a domain-theoretic approach to higher-order exact real number computation
We develop a theory of higher-order exact real number computation based on Scott domain theory. Our main object of investigation is a higher-order functional programming language, Real PCF, which is an extension of PCF with a data type for real numbers and constants for primitive real functions. Real PCF has both operational and denotational semantics, related by a computational adequacy proper...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 1998
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(05)80217-8